AN APPROACH TO IMAGE COMPRESSION AND ENCRYPTION

Image compression scheme proposed by researchers have no consideration of security. Similarly image encryption scheme proposed by the authors have no consideration of image size. In this paper a simultaneous image compression and encryption scheme is discussed. The order of the two processes viz. compression and encryption is EC i.e. image encryption is performed first then the image compression is applied. For image encryption a symmetric key cryptography multiplicative cipher is used. Similarly for compression Discrete Cosine Transform is used. Image Compression is concerned with minimizing the number of bit required to represent an image. The compression can be lossless or lossy. Image Encryption is hiding image from unauthorized access with the help of secret key that key can be private or public

AN OVERVIEW OF IMAGE SEGMENTATION ALGORITHMS

Image segmentation is a puzzled problem even after four decades of research. Research on image segmentation is currently conducted in three levels. Development of image segmentation methods, evaluation of segmentation algorithms and performance and study of these evaluation methods. Hundreds of techniques have been proposed for segmentation of natural images, noisy images, medical images etc. Currently most of the researchers are evaluating the segmentation algorithms using ground truth evaluation of (Berkeley segmentation database) BSD images. In this paper an overview of various segmentation algorithms is discussed. The discussion is mainly based on the soft computing approaches used for segmentation of images without noise and noisy images and the parameters used for evaluating these algorithms. Some of these techniques used are Markov Random Field (MRF) model, Neural Network, Clustering, Particle Swarm optimization, Fuzzy Logic approach and different combinations of these soft techniques

Modified Three-Step Search Block Matching Motion Estimation and Weighted Finite Automata based Fractal Video Compression

The major challenge with fractal image/video coding technique is that, it requires more encoding time. Therefore, how to reduce the encoding time is the research component remains in the fractal coding. Block matching motion estimation algorithms are used, to reduce the computations performed in the process of encoding. The objective of the proposed work is to develop an approach for video coding using modified three step search (MTSS) block matching algorithm and weighted finite automata (WFA) coding with a specific focus on reducing the encoding time. The MTSS block matching algorithm are used for computing motion vectors between the two frames i.e. displacement of pixels and WFA is used for the coding as it behaves like the Fractal Coding (FC). WFA represents an image (frame or motion compensated prediction error) based on the idea of fractal that the image has self-similarity in itself. The self-similarity is sought from the symmetry of an image, so the encoding algorithm divides an image into multi-levels of quad-tree segmentations and creates an automaton from the sub-images. The proposed MTSS block matching algorithm is based on the combination of rectangular and hexagonal search pattern and compared with the existing New Three-Step Search (NTSS), Three-Step Search (TSS), and Efficient Three-Step Search (ETSS) block matching estimation algorithm. The performance of the proposed MTSS block matching algorithm is evaluated on the basis of performance evaluation parameters i.e. mean absolute difference (MAD) and average search points required per frame. Mean of absolute difference (MAD) distortion function is used as the block distortion measure (BDM). Finally, developed approaches namely, MTSS and WFA, MTSS and FC, and Plane FC (applied on every frame) are compared with each other. The experimentations are carried out on the standard uncompressed video databases, namely, akiyo, bus, mobile, suzie, traffic, football, soccer, ice etc. Developed approaches are compared on the basis of performance evaluation parameters, namely, encoding time, decoding time, compression ratio and Peak Signal to Noise Ratio (PSNR). The video compression using MTSS and WFA coding performs better than MTSS and fractal coding, and frame by frame fractal coding in terms of achieving reduced encoding time and better quality of video

Image Segmentation using Various Approaches

This paper addresses the issue of image segmentation. Image segmentation process is the main basic process or technique used in various image processing problem domains, for example, content based image retrieval; pattern recognition; object recognition; face recognition; medical image processing; fault detection in product industries; etc. Scope of improvement exists in the following areas: Image partitioning; color based feature; texture based feature, searching mechanism for similarity; cluster formation logic; pixel connectivity criterion; intelligent decision making for clustering; processing time; etc. This paper presents the image segmentation mechanism which addresses few of the identified areas where the scope of contribution exists. Presented work basically deals with the development of the mechanism which is divided into three parts first part focuses on the color based image segmentation using k-means clustering methodology. Second part deals with region properties based segmentation. Later, deals with the boundary based segmentation. In all these three approaches, finally the Steiner tree is created to identify the class of the region. For this purpose the Euclidean distance is used. Experimental result justifies the application of the developed mechanism for the image segmentation

A Review on Block Matching Motion Estimation and Automata Theory based Approaches for Fractal Coding

Fractal compression is the lossy compression technique in the field of gray/color image and video compression. It gives high compression ratio, better image quality with fast decoding time but improvement in encoding time is a challenge. This review paper/article presents the analysis of most significant existing approaches in the field of fractal based gray/color images and video compression, different block matching motion estimation approaches for finding out the motion vectors in a frame based on inter-frame coding and intra-frame coding i.e. individual frame coding and automata theory based coding approaches to represent an image/sequence of images. Though different review papers exist related to fractal coding, this paper is different in many sense. One can develop the new shape pattern for motion estimation and modify the existing block matching motion estimation with automata coding to explore the fractal compression technique with specific focus on reducing the encoding time and achieving better image/video reconstruction quality. This paper is useful for the beginners in the domain of video compression

A COMPARATIVE STUDY OF IMAGE FILTERING ON VARIOUS NOISY PIXELS

This paper deals with the comparative study of research work done in the field of Image Filtering. Different noises can affect the image in different ways. Although various solutions are available for denoising them, a detail study of the research is required in order to design a filter which will fulfill the desire aspects along with handling most of the image filtering issues. An output image should be judged on the basis of Image Quality Metrics for ex-: Peak-Signal-to-Noise ratio (PSNR), Mean Squared Error (MSE) and Mean Absolute Error (MAE) and Execution Time

PERFORMING MULTIPLICATIONS IN IMAGE FILTERING PROCESS USING VEDIC MATHEMATICS

Image filtering is a very important step in image processing. Filtering involves lots of multiplications which consumes time. Time required increases with the increase in the number of pixels. This paper proposes an approach for image filtering using Vedic Mathematic which performs faster multiplication compared to the conventional algorithms namely Booth 2, Booth 3 and Array Multiplication Algorithm thus reducing the time required for filtering of images. Experimentation is done using C language. Time required by the algorithms for filtering are then compared using the experimental results

Object Detection and Tracking using Modified Diamond Search Block Matching Motion Estimation Algorithm

Object tracking is one of the main fields within computer vision. Amongst various methods/ approaches for object detection and tracking, the background subtraction approach makes the detection of object easier. To the detected object, apply the proposed block matching algorithm for generating the motion vectors. The existing diamond search (DS) and cross diamond search algorithms (CDS) are studied and experiments are carried out on various standard video data sets and user defined data sets. Based on the study and analysis of these two existing algorithms a modified diamond search pattern (MDS) algorithm is proposed using small diamond shape search pattern in initial step and large diamond shape (LDS) in further steps for motion estimation. The initial search pattern consists of five points in small diamond shape pattern and gradually grows into a large diamond shape pattern, based on the point with minimum cost function. The algorithm ends with the small shape pattern at last. The proposed MDS algorithm finds the smaller motion vectors and fewer searching points than the existing DS and CDS algorithms. Further, object detection is carried out by using background subtraction approach and finally, MDS motion estimation algorithm is used for tracking the object in color video sequences. The experiments are carried out by using different video data sets containing a single object. The results are evaluated and compared by using the evaluation parameters like average searching points per frame and average computational time per frame. The experimental results show that the MDS performs better than DS and CDS on average search point and average computation time

Load Balancing Based Approach to Improve Lifetime of Wireless Sensor Network

ABSTRACT In wireless sensor network, clustering is used as an effective technique to achieve scalability, selforganization, power saving, channel access, routing etc.[3

Modeling of Biodiesel Plant Design: Data Estimation and Generation Based on Suppositions and Interpolation

This paper presents the approach for the Biodiesel plant design data estimation and generation to support the mathematical formulation of the model. Presented approach is based on certain suppositions. Design data is estimated by using actual fundamentals involved in the design of the resources and equipments. Later, the sample space is increased by generating the design data. Design data is generated using the concept of linear interpolation, where the basic data fitting model is developed and then the intermediate design data values are obtained to increase the sample space. This facilitates the formulation of mathematical model. Experimental results are obtained through the MATLAB implementation